|
In combinatorial game theory, poset games are mathematical games of strategy, generalizing many well-known games such as Nim and Chomp.〔 In such games, two players start with a poset (a partially ordered set), and take turns choosing one point in the poset, removing it and all points that are greater. The player who is left with no point to choose, loses. ==Game play== Given a partially ordered set (''P'', <), let : denote the poset formed by removing ''x'' from ''P''. A poset game on ''P'', played between two players conventionally named Alice and Bob, is as follows: * Alice chooses a point ''x'' ∈ ''P''; thus replacing ''P'' with ''P''''x'', and then passes the turn to Bob who plays on ''P''''x'', and passes the turn to Alice. * A player loses if it is his/her turn and there are no points to choose. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「poset game」の詳細全文を読む スポンサード リンク
|